Identification of video subsequence using bipartite graph matching
نویسندگان
چکیده
منابع مشابه
Deformable Geometry Model Matching Using Bipartite Graph
In this paper, we present a novel method for efficient 3D model comparison. The method is designed to match highly deformed models through capturing two types of information. First, we propose a feature point extraction algorithm, which is based on “Level Set Diagram”, to reliably capture the topological points of a general 3D model. These topological points represent the skeletal structure of ...
متن کاملFingerprint identification using graph matching
Abstract--A new algorithm for automated fingerprint encoding and matching is presented. The algorithm is intended to be insensitive to imperfections introduced during fingerprint registration, such as noise. distortion and displacement. A fingerprint is represented in the form of a graph whose nodes correspond to ridges in the print. Edges of the graph connect nodes that represent neighboring o...
متن کاملsranjans : Semantic Textual Similarity using Maximal Weighted Bipartite Graph Matching
The paper aims to come up with a system that examines the degree of semantic equivalence between two sentences. At the core of the paper is the attempt to grade the similarity of two sentences by finding the maximal weighted bipartite match between the tokens of the two sentences. The tokens include single words, or multiwords in case of Named Entitites, adjectivally and numerically modified wo...
متن کاملBipartite Graph Matching Computation on GPU
The Bipartite Graph Matching Problem is a well studied topic in Graph Theory. Such matching relates pairs of nodes from two distinct sets by selecting a subset of the graph edges connecting them. Each edge selected has no common node as its end points to any other edge within the subset. When the considered graph has huge sets of nodes and edges the sequential approaches are impractical, specia...
متن کاملBipartite Graph Matching for Keyframe Summary Evaluation
A keyframe summary, or “static storyboard”, is a collection of frames from a video designed to summarise its semantic content. Many algorithms have been proposed to extract such summaries automatically. How best to evaluate these outputs is an important but little-discussed question. We review the current methods for matching frames between two summaries in the formalism of graph theory. Our an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Brazilian Computer Society
سال: 2011
ISSN: 0104-6500,1678-4804
DOI: 10.1007/s13173-011-0036-4